package com.foxzzz.dynamic.programming;

public class Solution70 {
    public int climbStairs(int n) {
        if (n <= 1) return 1;
        //dp[1] 代表第一格楼梯上有几种可能
        int[] dp = new int[n + 1];
        dp[0] = 1;dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }

    public static void main(String[] args) {
        System.out.println(new Solution70().climbStairs(5));
    }
}
